Closure properties in radical theory

A Complexity Theory for Feasible Closure Properties

The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not currently known to be feasible (such as the NP-complete sets and the PSPACE-complete sets ). For the study of the complexity of closure proper...

Closure, Properties and Closure Properties of Multirelations

Basic Properties of Closure Spaces

This technical report summarized facts from the basic theory of generalized closure spaces and gives detailed proofs for them. Many of the results collected here are well known for various types of spaces. We have made no attempt to find the original proofs. 1. Set-Valued Set-Functions 1.1. Closure, Interior, Neighborhood, and Convergent. In this section, which in part generalizes the results o...

On Closure Properties of GapL

We show necessary and sufficient conditions that certain algebraic functions like the rank or the inertia of an integer matrix can be computed in GapL.

Matrix-exponential distributions: Closure properties

Analysing the properties of a probability distribution is a question of general interest. In this paper we describe the properties of the matrix-exponential class of distributions, developing some properties for the discrete case and proving the closure properties, which for the case of phase-type distributions are extended to the matrix-exponential case, this not being an immediate consequence...